Value chain plan linking method, value chain plan linking apparatus, and value chain plan linking system

ABSTRACT

A plan parameter obtaining an optimal result between a plurality of software pieces that are linkingly operated is calculated. A value chain plan linking method that uses a value chain plan linking apparatus that combines and executes a plurality of software pieces according to a task. At least any one of the plurality of software pieces uses, as an input parameter, an output parameter obtained from any one of other software pieces included in the plurality of software pieces. The value chain plan linking apparatus executes a different solution requiring step of calculating a plurality of the output parameters in each of the plurality of software pieces, and a displaying step of displaying, as an overall plan, the output parameter obtaining a best key performance indicator value in the entire value chain according to a combination of the input and output parameters of the plurality of software pieces.

TECHNICAL FIELD

The present invention relates to a value chain plan linking method, avalue chain plan linking apparatus, and a value chain plan linkingsystem. The present invention claims the priority of Japanese PatentApplication No. 2020-156429 filed on Sep. 17, 2020, and for designatedcountries where incorporation by reference of the literature ispermitted, the content described in the application is incorporatedherein by reference.

BACKGROUND ART

Patent Literature 1 discloses that a robust optimizing apparatus thatcan efficiently calculate a design value that gives a Pareto solutionwith less variation is provided.

CITATION LIST Patent Literature

Patent Literature 1: Japanese Patent Application Publication No.2013-12185

SUMMARY OF INVENTION Technical Problem

In Patent Literature 1 described above, in linkingly operating aplurality of application software pieces in a usage relationship ininput and output such that the output of one application software pieceis used as an input value by the other application software piece, thecalculation itself of a plurality of solutions in the single applicationsoftware is enabled, but it is difficult to perform solution calculationin consideration of the optimization of the output of the applicationsoftware on the using side.

An object of the present invention is to provide a technique forcalculating a plan parameter obtaining an optimal result between aplurality of software pieces that are linkingly operated.

Solution to Problem

This application includes a plurality of means for solving at least partof the above problem, and an example thereof is given as follows.

An aspect of the present invention is a value chain plan linking methodthat uses a value chain plan linking apparatus that combines andexecutes a plurality of software pieces according to a task. At leastany one of the plurality of software pieces uses, as an input parameter,an output parameter obtained from any one of other software piecesincluded in the plurality of software pieces. The value chain planlinking apparatus executes a different solution requiring step ofcalculating a plurality of the output parameters in each of theplurality of software pieces, and a displaying step of displaying, as anoverall plan, the output parameter obtaining a best key performanceindicator value in the entire value chain according to a combination ofthe input and output parameters of the plurality of software pieces.

Advantageous Effects of Invention

According to the present invention, it is possible to calculate the planparameter obtaining the optimal result between the plurality of softwarepieces that are linkingly operated.

Objects, configurations, and effects other than the above will beapparent from the description of the following embodiment.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram illustrating a configuration example of a valuechain plan linking system according to a first embodiment.

FIG. 2 is a diagram illustrating an example of the data structure ofapplication master information.

FIG. 3 is a diagram illustrating an example of the data structure ofoperation variable information.

FIG. 4 is a diagram illustrating an example of the data structure ofapplication chain information.

FIG. 5 is a diagram illustrating an example of the data structure ofexecution history information.

FIG. 6 is a diagram illustrating an example of the data structure of jobchain information.

FIG. 7 is a diagram illustrating an example of the data structure ofoptimization result information.

FIG. 8 is a diagram illustrating an example of the data structure ofoptimization result detail information.

FIG. 9 is a diagram illustrating an example of the data structure ofscenario information.

FIG. 10 is a diagram illustrating an example of the hardwareconfiguration of a value chain plan linking apparatus.

FIG. 11 is a diagram illustrating an example of the flow of a valuechain plan linking process.

FIG. 12 is a diagram illustrating an example of an optimal solutiondisplay screen.

FIG. 13 is a diagram illustrating an execution example of the valuechain plan linking process.

DESCRIPTION OF EMBODIMENTS

In the following embodiment, the present invention will be described bybeing divided into a plurality of sections or embodiments when it isnecessary for convenience, but except for the case of being particularlyspecified, these are not independent of one another, and are in arelationship in which one is the modification example, the detail, thesupplementary explanation, and the like in part or in whole of theother.

Also, in the following embodiment, in referring to the number and thelike (including the number of pieces, the numerical value, the quantity,the range, and the like) of elements, except for the case of beingparticularly specified, the case of being obviously limited to aspecified number in principle, and the like, the number and the like ofthe elements are not each limited to the specified number, and may bemore or less than the specified number.

Further, in the following embodiment, needless to say, the componentsthereof (also including an element step and the like) are notnecessarily required, except for the case of being particularlyspecified, the case of being considered to be obviously required inprinciple, and the like.

Likewise, in the following embodiment, in referring to the shape, theposition relationship, and the like of the components and the like, theyinclude those that are substantially approximate or similar to the shapeand the like, except for the case of being particularly specified, thecase of being considered to be obviously otherwise in principle, and thelike. This is ditto for the numerical value and the range.

Also, in all the drawings for explaining the embodiment, the samemembers are indicated by the same reference numerals as a rule, and therepeated description thereof is omitted. Hereinbelow, each embodiment ofthe present invention will be described with reference to the drawings.

A value chain is referred to as the chain of a value given at each stagein product supplying processes from raw material and componentprocurement to delivery through manufacture, inventory management, andsales. Although the delivery and inventory management tasks are notprocesses that directly give a value to an article, it is desirable tominimize those costs in order to directly reduce corporate profits.Therefore, to optimally operate the value chain, it is necessary topursue both of maximized profits and minimized cost.

However, when the respective supplying processes configuring the valuechain are individually seen, those KPIs (Key Performance Indicators) maybe different from each other. By taking a manufacturing department as anexample, in software that makes a detailed schedule (hereinafter,sometimes referred to as application software and an application), theKPI of the manufacturing department using the software is theminimization of the manufacture cost, so that making a plan thatminimizes the change of a facility is an optimal plan. That is,manufacturing the same products together at the same time is an optimalplan.

On the other hand, in software that makes a product delivery plan, theKPI of a delivering department using the software is the minimization ofthe arrangement cost, so that loading a plurality of products requestedby a demand place onto the same truck is an optimal plan. However,assuming the case where the plurality of products are delivered to thedemand place, when the same products are completed at the same time asdescribed above, the departure of the truck is required to be delayedand to be standby until a time at which other products are manufactured.This leads to inefficiency.

Further, since the space for loading the products onto the truck islimited in the factory, the number of trucks that can arrive and departat the same time is limited. Consequently, when the completion date andtime plan of the products outputted by the detailed schedule software isinputted to the delivery plan software, each truck is required to bestandby until the completion of the products, with the result that thereis even a possibility that the number of trucks that can arrive anddepart is exceeded, which results in a non-executable solution in thedelivery plan software.

According to a value chain plan linking method, apparatus, and systemaccording to the present invention, in the value chain plan system thatlinkingly operates a plurality of application software pieces in a usagerelationship in input and output such that the output of one applicationsoftware piece is used as an input value by the other applicationsoftware piece, an efficient plan that can be executed in the entirevalue chain can be made with consistency, so that reduction in inventoryassets and improvement in production and sales efficiency can beexpected.

FIG. 1 is a diagram illustrating a configuration example of the valuechain plan linking system according to a first embodiment. A value chainplan linking system 1 includes a value chain plan linking apparatus 100that combines and executes a plurality of software pieces according to atask, and a user terminal device 200 that can be communicatablyconnected to the value chain plan linking apparatus 100 via a network50.

The network 50 is, for example, any one of a communication network thatuses, in part or in whole, a typical public line such as a LAN (LocalArea Network), a WAN (Wide Area Network), a VPN (Virtual PrivateNetwork), and the Internet, a mobile phone communication network, andthe like, or a complexed network of these. Note that, the network 50 maybe a radio communication network by Wi-Fi (registered trademark), 5G(Generation), and the like.

The value chain plan linking apparatus 100 includes a storing unit 110,a processing unit 120, an inputting/outputting unit 130, and acommunicating unit 140. Note that of the plurality of software piecesconfiguring the value chain executed by the value chain plan linkingapparatus 100, at least any one of the plurality of software piecesuses, as an input parameter, an output parameter obtained from anyone ofother software pieces included in the plurality of software pieces.

The storing unit 110 includes application master information 111,operation variable information 112, application chain information 113,execution history information 114, job chain information 115,optimization result information 116, optimization result detailinformation 117, and scenario information 118.

FIG. 2 is a diagram illustrating an example of the data structure of theapplication master information. In the application master information111, an application ID 111 a, an application name 111 b, a parameter ID111 c, a KPI 111 d, and the generation number 111 e of solutions areassociated with each other.

The application ID 111 a and the application name 111 b are informationidentifying an entry point for exhibiting a series of functions of thesoftware operation in the value chain plan linking system 1. Forexample, the application ID 111 a is information identifying theprocessing unit of the predetermined software operation, and is anidentifier assigned without being overlapped. The application name 111 bis a name given to the processing unit identified by the certainapplication ID.

The parameter ID 111 c is information identifying a variable or avariable group read in the software identified by the application ID 111a. The KPI 111 d is information identifying a variable (used for theevaluation of an output) regarded as important in the softwareidentified by the application ID 111 a. The generation number 111 e ofsolutions is information identifying the upper limit of the numberobtaining robust solutions in the software identified by the applicationID 111 a. Note that in the embodiment according to the presentinvention, the robust solutions are a plurality of suboptimal solutionsobtaining the KPIs of some degree by operating the parameter that thesoftware has, with respect to one input so as not to cause deadlock andthe like in the succeeding software.

FIG. 3 is a diagram illustrating an example of the data structure of theoperation variable information. The operation variable is, of inputinformation used by the software, a variable operable from the outsideof the software, that is, an independent variable defined by a set valueand the like, and is a variable that can change the output informationof the software. In the operation variable information 112, a parameterID 112 a, an input file 112 b, a column name 112 c, the number 112 d ofrows, an upper limit 112 e, and a lower limit 112 f are associated witheach other.

The parameter ID 112 a is information identifying the variable or thevariable group read in the software. The input file 112 b is informationidentifying a file in which the variable group identified by theparameter ID 112 a is stored. The column name 112 c is informationidentifying the name of the variable identified by the parameter ID 112a, in the file identified by the input file 112 b.

The number 112 d of rows is information identifying the position (thenumber of rows) in the file in which the variable identified by thecolumn name 112 c is stored. The upper limit 112 e and the lower limit112 f are information respectively deciding the upper limit and thelower limit of the value that can be taken by the variable identified bythe parameter ID 112 a.

FIG. 4 is a diagram illustrating an example of the data structure of theapplication chain information. In the application chain information 113,a previous application ID 113 a and an application ID 113 b areassociated with each other.

The previous application ID 113 a is information identifying, of twosoftware pieces in a relationship in which they are operatedcontinuously, the software that is operated precedingly. And, theapplication ID 113 b is information identifying, of two software piecesin a relationship in which they are operated continuously, the softwareoperated following the software that is operated precedingly. That is,in the application chain information 113, the preceding softwareidentified by the previous application ID 113 a and the succeedingsoftware identified by the application ID 113 b are associated with eachother according to the execution order thereof.

FIG. 5 is a diagram illustrating an example of the data structure of theexecution history information. In the execution history information 114,an application ID 114 a, a solution No. 114 b, a parameter ID 114 c, aparameter value 114 d, a KPI 114 e, and a solution candidate flag 114 fare associated with each other.

The application ID 114 a is information identifying the executedsoftware. The solution No. 114 b is information identifying a solutionthat is a result outputted by the software identified by the applicationID 114 a. The parameter ID 114 c is information identifying a variableused for input by the software identified by the application ID 114 a.The parameter value 114 d is information identifying the value of thevariable identified by the parameter ID 114 c.

The KPI 114 e is information identifying the value of the KPI of theresult outputted by the software identified by the application ID 114 a.The solution candidate flag 114 f is information indicating, accordingto whether or not the software identified by the application ID 114 a isnon-executable, “No” when it is non-executable and “Yes” when it isexecutable.

FIG. 6 is a diagram illustrating an example of the data structure of thejob chain information. In the job chain information 115, a previousapplication ID 115 a, an input solution No. 115 b, an application ID 115c, a solution No. 115 d, and a solution result 115 e are associated witheach other.

The previous application ID 115 a is information identifying, of twosoftware pieces that are executed continuously, the software that isexecuted precedingly. The input solution No. 115 b is informationidentifying a solution that is a result outputted by the softwareidentified by the previous application ID 115 a. This solution is alsosaid to be an input solution since it is used as an input by, of the twosoftware pieces that are executed continuously, the software that isexecuted succeedingly.

The application ID 115 c is information identifying the software that isexecuted continuously following the software identified by the previousapplication ID 115 a. The solution No. 115 d is information identifyinga solution that is a result outputted by the software identified by theapplication ID 115 c.

The solution result 115 e is information indicating, according towhether or not the software identified by the application ID 115 c isnon-executable, “Failure” when it is non-executable and “Success” whenit is executable.

FIG. 7 is a diagram illustrating an example of the data structure of theoptimization result information. In the optimization result information116, a scenario ID 116 a and an optimal KPI 116 b are associated witheach other.

The scenario ID 116 a is information given to each plan making of thevalue chain and discriminating a certain plan from other plans. Theoptimal KPI 116 b is the value of the KPI that becomes optimal for theplan identified by the scenario ID 116 a.

FIG. 8 is a diagram illustrating an example of the data structure of theoptimization result detail information. In the optimization resultdetail information 117, a scenario ID 117 a, an application ID 117 b, asolution No. 117 c, a parameter ID 117 d, and a parameter value 117 eare associated with each other.

The scenario ID 117 a is information given to each plan making of thevalue chain and discriminating a certain plan from other plans. Theapplication ID 117 b is information identifying the software executedfor the plan identified by the scenario ID 117 a. The solution No. 117 cis information identifying a solution that is a result outputted by theapplication ID 117 b. The parameter ID 117 d is information identifyingthe parameter included in the solution identified by the solution No.117 c. The parameter value 117 e is information identifying the value ofthe parameter identified by the parameter ID 117 d.

FIG. 9 is a diagram illustrating an example of the data structure of thescenario information. In the scenario information 118, a scenario ID 118a and a scenario name 118 b are associated with each other.

The scenario ID 118 a is information given to each plan making of thevalue chain and discriminating a certain plan from other plans. Thescenario name 118 b is information identifying the name of the planidentified by the scenario ID 118 a.

Each information piece of the storing unit 110 maybe obtained, asneeded, from, for example, a system such as ERP (Enterprise ResourcePlanning), or a database accumulating data equivalent thereto via thenetwork 50, or from an NAS (Network Attached Storage) device, and thelike via the communicating unit 140. Also, each information piece of thestoring unit 110 includes an output parameter, and the output parametercan be utilized as information used in another resource plan systemdifferent from the value chain plan linking apparatus 100 by beingoverwrite-saved. Further, when the storing unit 110 is stored in the NASdevice and the like, the input and output parameters when a best KPIvalue is obtained are selected, and are overwrite-saved, so that theycan be transmitted to other resource plan system different from thevalue chain plan linking apparatus.

The description of FIG. 1 is returned. The processing unit 120 includesa set information reading unit 121, an application executing unit 122, adifferent solution requiring unit 123, a plan combining unit 124, a planevaluating unit 125, and a display controlling unit 126.

The set information reading unit 121 loads data necessary for theprocess from the storing unit 110.

The application executing unit 122 executes the plurality of softwarepieces in a predetermined order, and stores key performance indicatorvalues together with output parameters into the storing unit 110. Theplurality of software pieces executed by the application executing unit122 include various types of software, and includes, for example, atleast software outputting an inventory plan configuring the value chain,software outputting a production plan, and the like. In addition,various software pieces, such as software outputting a transportationplan, are included.

When the software executed by the application executing unit 122calculates a non-executable solution, the different solution requiringunit 123 calculates an output parameter that becomes a robust optimalsolution in the previous software that outputs information used as theinput parameter of the software.

The plan combining unit 124 extracts, of the processing results of thesoftware executed by the application executing unit 122, the processingresult that obtains an executable solution.

The plan evaluating unit 125 sums the key performance indicator valuesaccording to the combinations of the input and output parameters of theplurality of software pieces.

The display controlling unit 126 generates screen information displayedincluding the success or failure of the summed result, and displays iton a displaying unit such as a display device. Alternatively, the screeninformation is transmitted to the user terminal device 200, and isdisplayed on the display device of the user terminal device 200.

For example, the inputting/outputting unit 130 displays the screeninformation including the information outputted as a consequence ofperforming the predetermined process, and receives input informationinputted by a keyboard, a mouse, a touch panel, and the like.

The communicating unit 140 performs the transmission and reception ofinformation between it and other devices including the user terminaldevice 200 via the network 50.

The user terminal device 200 is an information processing device thatcan be operated by a value chain plan maker. The user terminal device200 is an information processing device such as a typical personalcomputer, including a storing unit holding data, an inputting/outputtingunit controlling input and output, and a processing unit performingvarious processes.

FIG. 10 is a diagram illustrating an example of the hardwareconfiguration of the value chain plan linking apparatus. The value chainplan linking apparatus 100 can be achieved by a typical computer 300including a central processing unit (CPU) 301, a memory 302, an externalstorage device 303 such as a hard disk drive (HDD), a reading device 305reading information with respect to a storage medium 304 havingportability such as a CD (Compact Disk) and a DVD (Digital VersatileDisk), an inputting device 306 such as a keyboard, a mouse, and abarcode reader, an outputting device 307 such as a display, and acommunicating device 308 communicating with other computers via thenetwork 50 such as the Internet, or by a network system including aplurality of the computers 300. Note that needless to say, the readingdevice 305 may enable not only reading but also writing with respect tothe storage medium 304 having portability.

For example, the set information reading unit 121, the applicationexecuting unit 122, the different solution requiring unit 123, the plancombining unit 124, the plan evaluating unit 125, and the displaycontrolling unit 126 included in the processing unit 120 can be achievedby loading the predetermined program stored in the external storagedevice 303 onto the memory 302 and executing it by the CPU 301, theinputting/outputting unit 130 can be achieved such that the CPU 301 usesthe inputting device 306 and the outputting device 307, thecommunicating unit 140 can be achieved such that the CPU 301 uses thecommunicating device 308, and the storing unit 110 can be achieved suchthat the CPU 301 uses the memory 302 or the external storage device 303.

The predetermined program achieving the processing unit 120 may bedownloaded to the external storage device 303 from the storage medium304 having portability via the reading device 305 or from the network 50via the communicating device 308, and then, be loaded onto the memory302 to be executed by the CPU 301. Also, the predetermined programachieving the processing unit 120 may be directly loaded onto the memory302 from the storage medium 304 having portability via the readingdevice 305 or from the network via the communicating device 308, and beexecuted by the CPU 301.

Note that the user terminal device 200 can also be achieved by thetypical computer 300 as illustrated in FIG. 10 .

FIG. 11 is a diagram illustrating an example of the flow of a valuechain plan linking process. The value chain plan linking process isstarted when the value chain plan linking apparatus 100 receives arequest after start-up or according to a predetermined period (forexample, daily).

First, the set information reading unit 121 reads the master data (stepS001). Specifically, the set information reading unit 121 reads theapplication master information 111, the operation variable information112, the application chain information 113, and the scenario information118. In each of the following processes, the execution is controlled foreach scenario ID in the scenario information 118.

The application executing unit 122 determines whether or not the lastapplication has been ended in the application chain on the scenario(step S002). Specifically, the application executing unit 122 refers tothe application chain information 113, and determines whether or not theapplication ID of the software in which the process has been completedis included in the previous application ID 113 a. When it is notincluded, the application executing unit 122 determines that the lastapplication has been ended (in step S002, “Yes”), and advances thecontrol to step S011. When it is included, the application executingunit 122 determines that the last application has not been ended (instep S002, “No”) since the succeeding software is still present, and theapplication executing unit 122 advances the control to step S003.

The application executing unit 122 executes the current application foreach execution result of the previous application (step S003).Specifically, the application executing unit 122 refers to theapplication chain information 113, searches for the last-executedsoftware from the previous application ID 113 a, and refers to theassociated application ID 113 b to execute the corresponding software(The software executed is the current application.). For the execution,when there are a plurality of sets of the results outputted from theprevious application, the application executing unit 122 executes thesoftware for each result. Note that at the time of the first-timeexecution, the application executing unit 122 executes the only softwarethat has an entry in the previous application ID 113 a, the softwarebeing the application not present in the application ID 113 b. In thismanner, the application executing unit 122 executes the software fromthe head of the application chain.

The application executing unit 122 stores, in the execution historyinformation 114, the execution results of the software corresponding tothe application ID 113 b, as the solution No. used as the input value,the ID and the value of the parameter, and the KPI obtained as aconsequence of the execution. Also, the application executing unit 122creates and stores the execution results of the software correspondingto the application ID 113 b also for the job chain information 115.

Then, the application executing unit 122 determines whether or not thereis no non-executable solution (step S004). Specifically, the applicationexecuting unit 122 identifies the result determined to be non-executablein the processing result of the executed current application. When thereis no non-executable solution and all solutions are executable (in stepS004, “Yes”), the application executing unit 122 advances the control tostep S009.

When there is a non-executable solution (in step S004, “No”), theapplication executing unit 122 stores “No” when the solution isnon-executable for the solution candidate flag 114 f of the software(step S005). Further, when the solution is non-executable, theapplication executing unit 122 changes the solution result 115 e of thejob chain information 115 to “Failure”.

Then, the different solution requiring unit 123 refers to the previousapplication ID 115 a of the record in which the solution result 115 e ofthe job chain information 115 is “Failure”, and searches for the recordcorresponding to the application ID 114 a of the execution historyinformation 114. Then, the different solution requiring unit 123 refersto the KPI 114 e for the searched result, and selects the solution No.114 b that obtains the best KPI. That is, the different solutionrequiring unit 123 identifies the parameter that obtains the best KPI inthe previous application of the software that leads to the deriving ofthe non-executable solution.

Then, the different solution requiring unit 123 uses, as the initialoperation variable values, the parameter ID 114 c and the parametervalue 114 d of the execution history information 114, to calculate oneor a plurality of robust optimal solutions within the range of the upperlimit 112 e and the lower limit 112 f indicated in the operationvariable information 112 (step S006). That is, the different solutionrequiring unit 123 calculates one or a plurality of output parameterseach becoming a robust optimal solution on the basis of the outputparameter when the KPI of the previous software becomes best within therange of the parameters used for processing the previous softwarepreviously stored in the operation variable information 112 of thestoring unit 110. Note that the robust optimal solution calculationmethod may use, for example, Bayesian optimization, machine learning,and the like, or may use sensitivity analysis and the like in amathematical programming method.

In the robust optimal solution calculating process, the differentsolution requiring unit 123 calculates a plurality of operation variablevalues that can calculate the best KPI. The number of solutionscalculated is identified by each software piece in the generation number111 e of solutions of the application master information 111. Theexecution of the software is required in the robust optimal solutioncalculation, and the application executing unit 122 is used for theexecution.

Then, the application executing unit 122 determines whether or not allsolutions of the current application are non-executable (step S007).Specifically, the application executing unit 122 determines, from theexecution history information 114, whether or not each robust optimalsolution calculated in step S006 and other all solutions of the currentapplication are non-executable.

When all solutions are non-executable (in step S007, “Yes”), theapplication executing unit 122 adds the robust optimal solution in theprevious application (step S008). Specifically, the applicationexecuting unit 122 refers to the application chain information 113, andidentifies the previous application ID 113 a of the current application.Then, the robust optimal solution is calculated in the identifiedprevious application, and the control is returned to step S003.

When any one of the solutions is obtained (in step S007, “No”), theapplication executing unit 122 registers the execution history (stepS009). Specifically, the application executing unit 122 stores “Yes”when the solution is executable for the solution candidate flag 114 f ofthe software, and stores, as the plan linking information, the executionhistory information 114 and the job chain information 115.

Then, the application executing unit 122 advances the process to thenext application (step S010). Specifically, the application executingunit 122 refers to the application chain information 113, identifies therecord in which the current application has the previous application ID113 a, and identifies, as the current application, the application thatis executed succeedingly. Then, the application executing unit 122returns the control to step S002.

When the last application has been ended (in step S002, “Yes”), the plancombining unit 124 and the plan evaluating unit 125 extract the globalsolution in which the KPI becomes maximum (step S011). Specifically, theplan combining unit 124 refers to the execution history information 114and the job chain information 115 included in the plan linkinginformation, and extracts the record in which the solution candidateflag 114 f is “Yes” and the record in which the solution result 115 e is“Success”.

Then, the plan evaluating unit 125 creates the optimization resultinformation 116 by targeting the records extracted by the plan combiningunit 124. The plan evaluating unit 125 sums, for each scenario, the KPIs1114 f of the execution history information 114 associated with the jobchain information 115 configuring the scenario, and selects the best KPIto store it in the optimal KPI 116 b for each scenario ID 116 a.

Note that in this KPI summation, the plan evaluating unit 125 mayperform the summation by performing weighing to each KPI according tothe character of the value of the KPI, the indicator value regarded asimportant, a combination of the input and output parameters of theplurality of software pieces, and the like. For example, when the valueof the KPI that should be a small value and the value of the KPI thatshould be a large value are simply summed, the possibility that theevaluation of the global KPI cannot be appropriate is great, so that theprocessing of some value may be performed to calculate the global KPI.

Also, the plan evaluating unit 125 creates the optimization resultdetail information 117 by targeting the records extracted by the plancombining unit 124. The data indicating the operation variable of eachapplication obtaining the value chain plan that can be consistentlyexecuted is stored in the optimization result detail information 117.

Then, the display controlling unit 126 outputs the optimal solution onthe user screen (step S012). Specifically, the display controlling unit126 refers to the optimization result detail information 117, generatesthe display screen including the KPI breakdown of each application whenthe global KPI is optimal, and outputs it to the display device or theuser terminal device 200.

The above is an example of the flow of the value chain plan linkingprocess. According to the value chain plan linking process, it ispossible to calculate the plan parameter obtaining the optimal resultbetween the plurality of software pieces that are linkingly operated.

FIG. 12 is a diagram illustrating an example of the optimal solutiondisplay screen. The display controlling unit 126 creates an optimalsolution display screen 500 by using the optimization result information116 and the optimization result detail information 117. An example isillustrated in which the optimal solution display screen 500 displays ascenario list region 510 receiving the selection of the scenario createdby each user, a KPI graph display region 520 graphing the global KPI foreach scenario, and a breakdown display region 530 displaying, for eachapplication, a breakdown obtaining the optimal KPI of each scenario.When the user selects the scenario, of the combinations of the plansexecutable in the entire value chain, the optimal KPI in shading displayand the KPIs of other executable plans can be displayed in the lowerportion, and the parameter values of the respective applications and theKPIs at that time can be individually displayed.

FIG. 13 is a diagram illustrating an execution example of the valuechain plan linking process. The application executing unit 122 executesan A application 410, a B application 420, and a C application 430 inthat order. This can be said to be an example when as a combination of“the previous application ID, the application ID”, the information of“the A application, the B application” and the information of “the Bapplication, the C application” is included in the application chaininformation 113.

When the A application 410 outputs output information 411 by using inputinformation 400, the succeeding B application 420 outputs outputinformation 421 by using the output information 411. If the outputinformation 421 is non-executable, the different solution requiring unit123 generates the robust optimal solution (for example, outputinformation 411 a and output information 411 b) obtaining the similarKPI by identifying the output information 411 that becomes the best KPIin the A application 410 that is the previous application. Then, theapplication executing unit 122 executes the B application 420 by usingthe output information 411 a to obtain output information 422.

The C application 430 following the B application 420 outputs outputinformation 431 by using the output information 422. If the outputinformation 431 is non-executable, the different solution requiring unit123 generates the robust optimal solution (for example, outputinformation 422 a and output information 422 b) obtaining the similarKPI by identifying the output information 422 that becomes the best KPIin the B application 420 that is the previous application.

When the C application 430 performs the process by using the outputinformation 422 a and the output information 422 b, output information432 and output information 433 are respectively obtained. Even when theoutput information 432 and output information 433 are non-executable,the C application 430 can be executed by using, as input information,output information 424 by the B application 420 using the outputinformation 411 b that is the robust optimal solution of the outputinformation 411 by the A application 410, and output information 434 canbe obtained.

Then, in this example, the output of the A application 410 is identifiedand displayed by using, as the optimal solution, the solution obtainingthe best global KPI in the executed scenario. Note that in FIG. 13 , ofthe output information, a “cross” is indicated in the case of anon-executable result, a “triangle” is indicated in the case of a resultthat is executable but is normal, and a “circle” is indicated in thecase of a result in which the KPI is good, but another display may beperformed on the output screen.

The above is the plan linking system according to the first embodiment.According to the value chain plan linking system 1, it is possible tocalculate the plan parameter obtaining the optimal result between theplurality of software pieces that are linkingly operated, in particular,in the entire value chain.

Note that the present invention is not limited to the above embodiment,and includes various modification examples. For example, the planevaluating unit 125 performs the weighing calculation when the KPIsobtained in each application are summed for each scenario, but thepresent invention is not limited to this, and for example, may performthe calculation by using a predetermined algorithm. Alternatively, whenthere is a variation range in the KPIs obtained in each application, theglobal KPI may be calculated according to a KPI probabilitydistribution.

Also, the plan evaluating unit 125, which sums the KPIs, may also selectthe input and output parameters of the plan obtaining the best KPI totransmit them to other ERP system. By doing this, the plan evaluatingunit 125 can be automatically cooperated with various systems.

Also, part of the configuration of one embodiment can be replaced withthe configurations of other embodiments, and the configuration of theone embodiment can be added with the configurations of otherembodiments. Also, part of the configuration of each embodiment can besubjected to addition, deletion, and replacement with respect to otherconfigurations.

Also, in each configuration, function, processing unit, processingmeans, and the like of the above, some or all of these maybe achieved byhardware, for example, by designing by an integrated circuit and thelike. Also, each configuration, function, and the like of the above maybe achieved by software piece such that a processor construes andexecutes a program achieving each function. The information of theprogram, table, file, and the like achieving each function can be placedonto a recording device such as a memory, a hard disk, and an SSD, or arecording medium such as an IC card, an SD card, and a DVD.

Also, the control lines and the information lines that are considered tobe necessary for the description are represented, and all the controllines and information lines are not necessarily represented for theproduct. Actually, almost all the configurations may be considered to beconnected to each other by a communication network, a bus, and the like.

The technique according to the present invention is not limited to theplan linking system, but can be provided in various forms, such as aserver device, a computer readable program, and a value chain planningmethod. LIST OF REFERENCE SIGNS

1 . . . plan linking system, 50 . . . network, 100 . . . value chainplan linking apparatus, 110 . . . storing unit, 111 . . . applicationmaster information, 112 . . . operation variable information, 113 . . .application chain information, 114 . . . execution history information,115 . . . job chain information, 116 . . . optimization resultinformation, 117 . . . optimization result detail information, 118 . . .scenario information, 120 . . . processing unit, 121 . . . setinformation reading unit, 122 . . . application executing unit, 123 . .. different solution requiring unit, 124 . . . plan combining unit, 125. . . plan evaluating unit, 126 . . . display controlling unit, 130 . .. inputting/outputting unit, 140 . . . communicating unit, 200 . . .user terminal device

1. A value chain plan linking method that uses a value chain planlinking apparatus that combines and executes a plurality of softwarepieces according to a task, wherein at least any one of the plurality ofsoftware pieces uses, as an input parameter, an output parameterobtained from any one of other software pieces included in the pluralityof software pieces, and wherein the value chain plan linking apparatusexecutes: a different solution requiring step of calculating a pluralityof the output parameters in each of the plurality of software pieces;and a displaying step of displaying, as an overall plan, the outputparameter obtaining a best key performance indicator value in the entirevalue chain according to a combination of the input and outputparameters of the plurality of software pieces.
 2. The value chain planlinking method according to claim 1, wherein in the different solutionrequiring step, the value chain plan linking apparatus calculates, inthe process of the software, one or a plurality of the output parameterseach becoming a robust optimal solution.
 3. The value chain plan linkingmethod according to claim 1, wherein in the different solution requiringstep, the value chain plan linking apparatus calculates, in the processof the software, one or a plurality of the output parameters eachbecoming the robust optimal solution on the basis of the outputparameter when a key performance indicator value calculated by theoutput parameter of the software becomes best.
 4. The value chain planlinking method according to claim 1, wherein the output parameter isinformation used in another resource plan system different from thevalue chain plan linking apparatus.
 5. The value chain plan linkingmethod according to claim 1, wherein the value chain plan linkingapparatus executes a plan evaluating step of selecting the input andoutput parameters when a key performance indicator value calculated bythe output parameter becomes best, and transmitting the input and outputparameters to another resource plan system different from the valuechain plan linking apparatus.
 6. The value chain plan linking methodaccording to claim 1, wherein the value chain plan linking apparatusexecutes a plan evaluating step of performing summation by performingpredetermined weighing to a key performance indicator value calculatedby the output parameter according to a combination of the input andoutput parameters of the plurality of software pieces.
 7. The valuechain plan linking method according to claim 1, wherein the plurality ofsoftware pieces include at least one of a process for outputting aninventory plan and a process for outputting a production plan.
 8. Avalue chain plan linking apparatus that combines and executes aplurality of software pieces according to a task, wherein at least anyone of the plurality of software pieces uses, as an input parameter, anoutput parameter obtained from any one of other software pieces includedin the plurality of software pieces, and wherein the value chain planlinking apparatus includes: a different solution requiring unit thatcalculates a plurality of the output parameters in each of the pluralityof software pieces; and a display controlling unit that displays, as anoverall plan, the output parameter obtaining a best key performanceindicator value in the entire value chain according to a combination ofthe input and output parameters of the plurality of software pieces. 9.A value chain plan linking system that combines and executes a pluralityof software pieces according to a task, wherein at least any one of theplurality of software pieces uses, as an input parameter, an outputparameter obtained from any one of other software pieces included in theplurality of software pieces, and wherein the value chain plan linkingsystem includes: a different solution requiring unit that calculates aplurality of the output parameters in each of the plurality of softwarepieces; and a display controlling unit that displays, as an overallplan, the output parameter obtaining a best key performance indicatorvalue in the entire value chain according to a combination of the inputand output parameters of the plurality of software pieces.